Pattern Anomaly Detection based on Sequence-to-Sequence Regularity Learning
نویسندگان
چکیده
منابع مشابه
Sequence to Sequence Model for Anomaly Detection in Financial Transactions
We propose the use of a character-level sequence-to-sequence based model to perform anomaly detection in financial transactions defined by (request, response) pairs. We found empirically that we can use a single end-to-end model to learn patterns from a great variety of industry protocols with enough speed to perform real-time anomaly detection.
متن کاملSequence Matching and Learning in Anomaly Detection for Computer Security
Two problems of importance in computer security are to 1) detect the presence of an intruder masquerading as the valid user and 2) detect the perpetration of abusive actions on the part of an otherwise innocuous user. We have developed an approach to these problems that examines sequences of user actions (UNIX commands) to classify behavior as normal or anomalous. In this paper we explore the m...
متن کاملSequence Matching and Learning in Anomaly
Two problems of importance in computer security are to 1) detect the presence of an intruder masquerading as the valid user and 2) detect the perpetration of abusive actions on the part of an otherwise innocuous user. We have developed an approach to these problems that examines sequences of user actions (UNIX commands) to classify behavior as normal or anomalous. In this paper we explore the m...
متن کاملAnomaly Detection Using System Call Sequence Sets
This paper discusses our research in developing a generalized and systematic method for anomaly detection. The key ideas are to represent normal program behaviour using system call frequencies and to incorporate probabilistic techniques for classification to detect anomalies and intrusions. Using experiments on the sendmail system call data, we demonstrate that concise and accurate classifiers ...
متن کاملA pattern sequence approach to Stern's sequence
Let w ∈ 1{0, 1} * and let a w (n) be the number of occurrences of the word w in the binary expansion of n. Let {s(n)} n0 denote the Stern sequence, defined by s(0) = 0, s(1) = 1, and for n 1 s(2n) = s(n), and s(2n + 1) = s(n) + s(n + 1). In this note, we show that s(n) = a 1 (n) + w∈1{0,1} * s([w] 2)a w1 (n) where w denotes the complement of w (obtained by sending 0 → 1 and 1 → 0) and [w] 2 den...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tehnicki Vjesnik-technical Gazette
سال: 2023
ISSN: ['1330-3651', '1848-6339']
DOI: https://doi.org/10.17559/tv-20230325000479